Termination w.r.t. Q proof of TRS/TRCSREx1_2_AEL03

Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

from(X) → cons(X, n__from(n__s(X)))
2ndspos(0, Z) → rnil
2ndspos(s(N), cons(X, n__cons(Y, Z))) → rcons(posrecip(activate(Y)), 2ndsneg(N, activate(Z)))
2ndsneg(0, Z) → rnil
2ndsneg(s(N), cons(X, n__cons(Y, Z))) → rcons(negrecip(activate(Y)), 2ndspos(N, activate(Z)))
pi(X) → 2ndspos(X, from(0))
plus(0, Y) → Y
plus(s(X), Y) → s(plus(X, Y))
times(0, Y) → 0
times(s(X), Y) → plus(Y, times(X, Y))
square(X) → times(X, X)
from(X) → n__from(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
activate(n__from(X)) → from(activate(X))
activate(n__s(X)) → s(activate(X))
activate(n__cons(X1, X2)) → cons(activate(X1), X2)
activate(X) → X

Q is empty.

↳ QTRS

  ↳ DirectTerminationProof

Q restricted rewrite system:
The TRS R consists of the following rules:

from(X) → cons(X, n__from(n__s(X)))
2ndspos(0, Z) → rnil
2ndspos(s(N), cons(X, n__cons(Y, Z))) → rcons(posrecip(activate(Y)), 2ndsneg(N, activate(Z)))
2ndsneg(0, Z) → rnil
2ndsneg(s(N), cons(X, n__cons(Y, Z))) → rcons(negrecip(activate(Y)), 2ndspos(N, activate(Z)))
pi(X) → 2ndspos(X, from(0))
plus(0, Y) → Y
plus(s(X), Y) → s(plus(X, Y))
times(0, Y) → 0
times(s(X), Y) → plus(Y, times(X, Y))
square(X) → times(X, X)
from(X) → n__from(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
activate(n__from(X)) → from(activate(X))
activate(n__s(X)) → s(activate(X))
activate(n__cons(X1, X2)) → cons(activate(X1), X2)
activate(X) → X

Q is empty.

We use [23] with the following order to prove termination.

Recursive path order with status [2].
Quasi-Precedence:

[0, pi_1] > [2ndspos₂, 2ndsneg_2] > posrecip₁ > [n_{_s₁}, rnil, n_{_cons₂}, negrecip_1]
[0, pi_1] > [2ndspos₂, 2ndsneg_2] > activate₁ > from₁ > [cons₂, rcons_2] > [n_{_s₁}, rnil, n_{_cons₂}, negrecip_1]
[0, pi_1] > [2ndspos₂, 2ndsneg_2] > activate₁ > from₁ > n_{_from₁} > [n_{_s₁}, rnil, n_{_cons₂}, negrecip_1]
[0, pi_1] > [2ndspos₂, 2ndsneg_2] > activate₁ > s₁ > [cons₂, rcons_2] > [n_{_s₁}, rnil, n_{_cons₂}, negrecip_1]
square₁ > times₂ > plus₂ > s₁ > [cons₂, rcons_2] > [n_{_s₁}, rnil, n_{_cons₂}, negrecip_1]

Status:

from₁: multiset
n_{_from₁}: multiset
n_{_s₁}: multiset
rcons₂: multiset
0: multiset
negrecip₁: multiset
times₂: [2,1]
cons₂: [2,1]
square₁: multiset
2ndspos₂: [1,2]
activate₁: multiset
posrecip₁: [1]
plus₂: multiset
2ndsneg₂: [1,2]
s₁: multiset
n_{_cons₂}: multiset
pi₁: multiset
rnil: multiset